On C J and C T in conformal QED

Dr. C. J. C. Earl

T C C C

I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP * ACC0, which proceeds via a new algorithm for ACC0-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in th...

In Memoriam : J . C .

The charter of SRC is to advance both the state of knowledge and the state of the art in computer systems. From our establishment in 1984, we have performed basic and applied research to support Digital's business objectives , Our current work includes exploring distributed personal computing on multiple platforms, networking, programming technology, system modelling and management techniques, ...

T . J . Montville and M . L . Chikindas C . Herranz

T C P  C C++

Using a C++ compiler, any partial recursive function can be computed at compile time. We show this by using the C++ template mechanism to define functions via primitive recursion, composition, and μ-recursion.